Drawing planar 3-trees with given face areas
نویسندگان
چکیده
منابع مشابه
Drawing Planar Graphs with Prescribed Face Areas
This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The first one deals with straight-line drawings and the second one with orthogonal drawings. For straight-line drawings, it was known that such drawings exist for all planar graphs with maximum degree 3. We show here that such drawings exist for...
متن کاملUniversal Line-Sets for Drawing Planar 3-Trees
A set S of lines is universal for drawing planar graphs with n vertices if every planar graph G with n vertices can be drawn on S such that each vertex of G is drawn as a point on a line of S and each edge is drawn as a straight-line segment without any edge crossing. It is known that ⌊ 2(n−1) 3 ⌋ parallel lines are universal for any planar graph with n vertices. In this paper we show that a se...
متن کاملSimplices with Given 2-Face Areas
Every graph G can be represented in a Euclidean space as a unit distance graph; that is, there is an embedding { v: v E V(G)} c Rn of V(G) such that uv E E(G) iff iuvi= 1, see, e.g., [1, 2). As a similar kind of representation for a 3-uniform hypergraph H (shortly, a 3-graph), we may consider an embbeding { v: v E V(H)} c Rn such that uvw E E(H) iff the area of the triangle uvw is equal to 1. W...
متن کاملDrawing Planar Graphs with a Prescribed Inner Face
Given a plane graph G (i.e., a planar graph with a fixed planar embedding) and a simple cycle C in G whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of G. We characterize when this is possible in terms of simple necessary conditions, which we prove to be sufficient. This also leads to a linear-time te...
متن کاملConvex Polyhedra Realizing Given Face Areas
Given n ≥ 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.09.004